It has often been argued that Gödel’s first incompleteness theorem has major implications for our understanding of the human mind. Gödel himself hoped that the results of his theorem, combined with Turning’s work on computers and phenomenological analysis, would establish that the human mind contains an element totally different from a finite combinatorial mechanism. Decades of attempts to establish this by reasoning about Gödel’s theorem and Turing’s work are now widely taken to be unsuccessful. The present article, in accord with Gödel’s suggestion, adds extended phenomenological analysis to the discussion. It also focuses on the “going outside the system” step central to Gödel’s method of proof, rather than on the implications of the the...
In order to prove that mathematics cannot be exhausted by a finite set of procedures, Alan Turing co...
Present progress in mind science is racing away in the direction of denying the existence of human f...
Despite his unreserved appreciation of Turing’s analysis for being a “precise and unquestionably ade...
It has often been argued that Gödel’s first incompleteness theorem has major implications for our un...
ABSTRACT. In our paper, we show how to present Gödel’s analysis on the consequences of his incomp...
Lucas-Penrose type arguments have been the focus of many papers in the literature. In the present pa...
In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machin...
AbstractGödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, ...
Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, cla...
In this paper Lucas comes back to Gödelian argument against Mecanism to clarify some points. First o...
AbstractWe shall present some relations between consistency and reflection principles which explain ...
In the present paper we have discussed concerning Gödel’s incompleteness theorem(s) and plausible im...
The Turing Machine Halting Problem is a major problem in computer theory, Russell’s Paradox is the r...
Certain selected issues around the Gödelian anti-mechanist arguments which have received less attent...
Hofstadter [1979, 2007] offered a novel Gödelian proposal which purported to reconcile the apparentl...
In order to prove that mathematics cannot be exhausted by a finite set of procedures, Alan Turing co...
Present progress in mind science is racing away in the direction of denying the existence of human f...
Despite his unreserved appreciation of Turing’s analysis for being a “precise and unquestionably ade...
It has often been argued that Gödel’s first incompleteness theorem has major implications for our un...
ABSTRACT. In our paper, we show how to present Gödel’s analysis on the consequences of his incomp...
Lucas-Penrose type arguments have been the focus of many papers in the literature. In the present pa...
In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machin...
AbstractGödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, ...
Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, cla...
In this paper Lucas comes back to Gödelian argument against Mecanism to clarify some points. First o...
AbstractWe shall present some relations between consistency and reflection principles which explain ...
In the present paper we have discussed concerning Gödel’s incompleteness theorem(s) and plausible im...
The Turing Machine Halting Problem is a major problem in computer theory, Russell’s Paradox is the r...
Certain selected issues around the Gödelian anti-mechanist arguments which have received less attent...
Hofstadter [1979, 2007] offered a novel Gödelian proposal which purported to reconcile the apparentl...
In order to prove that mathematics cannot be exhausted by a finite set of procedures, Alan Turing co...
Present progress in mind science is racing away in the direction of denying the existence of human f...
Despite his unreserved appreciation of Turing’s analysis for being a “precise and unquestionably ade...